Claude Berge: 5.6.1926-30.6.2002
نویسنده
چکیده
The departure of Claude Berge leaves a painful void in many of our lives. He enchanted people around him with his multiple talents, his great erudition in diverse domains, his sense of humour, his modesty, his love of life. Although primarily a combinatorist, Berge made a lasting mark on other subjects with his early mathematical work. His treatise on game theory [2] introduced an alternative to the Nash equilibrium, which has become known as the Berge equilibrium [1, 28, 32]. His book on topological spaces [4] introduced a theorem which has become known as the Berge maximum theorem and is considered one of the most useful tools in economic theory [31, 35, 39]. Up to the 1950’s, many mathematicians considered combinatorics and graph theory somewhat disreputable. Berge did a lot to change this perception. His 1958 monograph on graph theory [3] was translated into English, Russian, Spanish, Romanian, and Chinese within five years. As Daniel Dugué [26] put it:
منابع مشابه
Perfect graphs: a survey
Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for graph theory, linear programming and combinatorial optimization. Claude Berge made a conjecture about them, that was proved by Chudnovsky, Robertson, Seymour and Thomas in 2002, and is now called the strong perfect graph theorem. This is a survey about perfect graphs, mostly focused on the strong perfect gr...
متن کاملClaude Berge and the “ Oulipo ”
is well-known in the Operational Research community for his path-breaking contributions to graph theory. He received several awards for his scientific achievements, including the EURO Gold Medal (1989) and the Euler Prize (1995, jointly with R.L. Graham). The name of Claude Berge is likely to remain in history for several other reasons. For instance he was an expert in the Asmat art from New-Gu...
متن کاملBerge Sorting Dedicated to Professor Masakazu Kojima on the occasion of his 60th birthday
In 1966, Claude Berge proposed the following sorting problem. Given a string of n alternating white and black pegs on a one-dimensional board consisting of an unlimited number of empty holes, rearrange the pegs into a string consisting of ⌈n 2 ⌉ white pegs followed immediately by ⌊n 2 ⌋ black pegs (or vice versa) using only moves which take 2 adjacent pegs to 2 vacant adjacent holes. Avis and D...
متن کاملOn the generalized Berge sorting conjecture
In 1966, Claude Berge proposed the following sorting problem. Given a string of n alternating white and black pegs, rearrange the pegs into a string consisting of ⌈n 2 ⌉ white pegs followed immediately by ⌊n 2 ⌋ black pegs (or vice versa) using only moves which take 2 adjacent pegs to 2 vacant adjacent holes. Berge’s original question was generalized by considering the same sorting problem usin...
متن کاملDead Cell Analysis in Hex and the Shannon Game
In 1981 Claude Berge asked about combinatorial properties that might be used to solve Hex puzzles. In response, we establish properties of dead, or negligible, cells in Hex and the Shannon game. A cell is dead if the colour of any stone placed there is irrelevant to the theoretical outcome of the game. We show that dead cell recognition is NPcomplete for the Shannon game; we also introduce two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 19 شماره
صفحات -
تاریخ انتشار 2003